Comparison Jaccard similarity, Cosine Similarity and Combined Both of the Data Clustering With Shared Nearest Neighbor Method
نویسندگان
چکیده
منابع مشابه
An Improved k-Nearest Neighbor Classification Algorithm Using Shared Nearest Neighbor Similarity
k-Nearest Neighbor (KNN) is one of the most popular algorithms for pattern recognition. Many researchers have found that the KNN classifier may decrease the precision of classification because of the uneven density of t raining samples .In view of the defect, an improved k-nearest neighbor algorithm is presented using shared nearest neighbor similarity which can compute similarity between test ...
متن کاملUnilateral Jaccard Similarity Coefficient
Similarity measures are essential to solve many pattern recognition problems such as classification, clustering, and retrieval problems. Various similarity measures are categorized in both syntactic and semantic relationships. In this paper we present a novel similarity, Unilateral Jaccard Similarity Coefficient (uJaccard), which doesn’t only take into consideration the space among two points b...
متن کاملSimilarity Image Retrieval with Signi cance-Sensitive Nearest-Neighbor Search
Nearest-neighbor (NN) search in high dimensional space is widely used for the similarity retrieval of images. Recent research results in the literature reveal that NNsearch might return insigni cant NNs in high dimensional space because points could be so scattered that every distance between them might yield no signi cant di erence. Insigni cant NNs are troublesome with respect to the e ciency...
متن کاملClustering with Shared Nearest Neighbor-unscented Transform Based Estimation
Subspace clustering developed from the group of cluster objects in all subspaces of a dataset. When clustering high dimensional objects, the accuracy and efficiency of traditional clustering algorithms are very poor, because data objects may belong to diverse clusters in different subspaces comprised of different combinations of dimensions. To overcome the above issue, we are going to implement...
متن کاملData Clustering and Similarity
In this article, we study the notion of similarity within the context of cluster analysis. We begin by studying different distances commonly used for this task and highlight certain important properties that they might have, such as the use of data distribution or reduced sensitivity to the curse of dimensionality. Then we study interand intra-cluster similarities. We identify how the choices m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Engineering and Applications Journal
سال: 2016
ISSN: 2252-5459,2252-4274
DOI: 10.18495/comengapp.v5i1.160